A note on disjoint arborescences
نویسندگان
چکیده
منابع مشابه
A note on disjoint arborescences
Recently Kamiyama, Katoh, and Takizawa have shown a theorem on packing arc-disjoint arborescences that is a proper extension of Edmonds’ theorem on disjoint spanning branchings. We show a further extension of their theorem, which makes clear an essential rôle of a reachability condition played in the theorem. The right concept required for the further extension is “convexity” instead of “reacha...
متن کاملDisjoint paths in arborescences
An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds characterizes which digraphs have λ arc-disjoint arborescences rooted at r. A similar theorem of Menger guarantees λ strongly arc disjoint rv-paths for every vertex v, where “strongly” means no two paths contain a pair of symmetric arcs. We prove that if a directed graph D contains two arc-disjoin...
متن کاملA note on disjoint dijoins
If q is a prime power, D is a directed graph such that the underlying undirected graph is (q−1, 1)-partition-connected, then D contains q disjoint dijoins.
متن کاملNote on Vertex-Disjoint Cycles
Häggkvist and Scott asked whether one can find a quadratic function q(k) such that if G is a graph of minimum degree at least q(k), then G contains vertex-disjoint cycles of k consecutive even lengths. In this paper, it is shown that if G is a graph of average degree at least k + 19k + 12 and sufficiently many vertices, then G contains vertex-disjoint cycles of k consecutive even lengths, answe...
متن کاملA Note on the Inapproximability of Induced Disjoint Paths
We study the inapproximability of the induced disjoint paths problem on an arbitrary n-node m-edge undirected graph, which is to connect the maximum number of the k sourcesink pairs given in the graph via induced disjoint paths. It is known that the problem is NP-hard to approximate within m 1 2 −ε for a general k and any ε > 0. In this paper, we prove that the problem is NP-hard to approximate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2010
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-010-2518-y